Outer automorphism groups of graph products: subgroups and quotients
نویسندگان
چکیده
We show that the outer automorphism groups of graph products finitely generated abelian satisfy Tits alternative, are residually finite, their so-called Torelli subgroups generated, and they a dichotomy between being virtually nilpotent containing non-abelian free subgroup is determined by graphical condition on underlying labelled graph. Graph simultaneously generalize right-angled Artin (RAAGs) Coxter (RACGs), providing common framework for studying these groups. Our results extend number known RAAGs and/or RACGs variety authors, including Caprace, Charney, Day, Ferov, Guirardel, Horbez, Minasyan, Vogtmann, Wade, current authors.
منابع مشابه
Compressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups
It is shown that the compressed word problem of a graph product of finitely generated groups is polynomial time Turing-reducible to the compressed word problems of the vertex groups. A direct corollary of this result is that the word problem for the automorphism group of a right-angled Artin group or a right-angled Coxeter group can be solved in polynomial time. Moreover, it is shown that a res...
متن کاملOn Outer Automorphism Groups of Coxeter Groups
It is shown that the outer automorphism group of a Coxeter group W of nite rank is nite if the Coxeter graph contains no innnite bonds. A key step in the proof is to show that if the group is irreducible and 1 and 2 any two bases of the root system of W, then 2 = w 1 for some w 2 W. The proof of this latter fact employs some properties of the dominance order on the root system introduced by Bri...
متن کاملOuter Automorphism Groups of Bieberbach Groups
Let Γ be a Bieberbach group it is a fundamental group of a flat manifold. In this paper we give necessary and sufficient conditions on Out(Γ) to be infinite. We also compare our result with the previous one ([8], Theorem 7.1) about Anosov automorphisms of flat manifolds. We give several examples of Bieberbach groups.
متن کاملCompressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed form. As a consequence it follows that the word problem for the outer automorphism group of a graph group can be solved in polynomial time.
متن کاملKazhdan Groups with Infinite Outer Automorphism Group
For each countable group Q we produce a short exact sequence 1 → N → G → Q → 1 where G is f.g. and has a graphical 1 6 presentation and N is f.g. and satisfies property T . As a consequence we produce a group N with property T such that Out(N) is infinite. Using the tools developed we are also able to produce examples of nonHopfian and non-coHopfian groups with property T . One of our main tool...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2021
ISSN: ['1945-5844', '0030-8730']
DOI: https://doi.org/10.2140/pjm.2021.314.161